Computation of Most Probable Numbers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Computation of the Most Probable Motion from Fuzzy Correspondences

An algorithm is presented for nding the most probable image motion between two images from fuzzy point correspondences. In fuzzy correspondence a point in one image is assigned to a region in the other image. Such a region can be line (aperture eeect) or a probability matrix. Noise and outliers are always present, and points may come from diierent motions. The presented algorithm, which uses li...

متن کامل

Efficient computation of the most probable motion from fuzzy correspondences

An algorithm is presented for finding the most probable image motion between two images from fuzzy point correspondences. In fuzzy correspondence a point in one image is assigned to a region in the other image. Such a region can be line (aperture effect) or a convex polygon. Noise and outliers are always present, and points may belong to different motions. The presented algorithm, which uses li...

متن کامل

The Most Probable Database Problem

This paper proposes a novel inference task for probabilistic databases: the most probable database (MPD) problem. The MPD is the most probable deterministic database where a given query or constraint is true. We highlight two distinctive applications, in database repair of key and dependency constraints, and in finding most probable explanations in statistical relational learning. The MPD probl...

متن کامل

E cient Computation of the Most Probable Motion from Fuzzy Correspondences

An algorithm is presented for nding the most probable image motion between two images from fuzzy point correspondences. In fuzzy correspondence a point in one image is assigned to a region in the other image. Such a region can be line (aperture e ect) or a probability matrix. Noise and outliers are always present, and points may come from di erent motions. The presented algorithm, which uses li...

متن کامل

On the Robustness of Most Probable Explanations

In Bayesian networks, a Most Probable Explanation (MPE) is a complete variable instantiation with the highest probability given the current evidence. In this paper, we discuss the problem of finding robustness conditions of the MPE under single parameter changes. Specifically, we ask the question: How much change in a single network parameter can we afford to apply while keeping the MPE unchang...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied and Environmental Microbiology

سال: 1983

ISSN: 0099-2240,1098-5336

DOI: 10.1128/aem.45.5.1646-1650.1983